Binary Cyclic codes with two primitive nonzeros
نویسندگان
چکیده
In this paper, we make some progress towards a well-known conjecture on the minimum weights of binary cyclic codes with two primitive nonzeros. We also determine the Walsh spectrum of Tr(x) over F2m in the case wherem = 2t, d = 3+2 t+1 and gcd(d, 2−1) = 1.
منابع مشابه
The weight distributions of some cyclic codes with three or four nonzeros over 𝔽3
Because of efficient encoding and decoding algorithms, cyclic codes are an important family of linear block codes, and have applications in communication and storage systems. However, their weight distributions are known only for a few cases mainly on the codes with one or two nonzeros. In this paper, the weight distributions of two classes of cyclic codes with three or four nonzeros are determ...
متن کاملOn the covering radius of some binary cyclic codes
We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We compute the covering radius of some binary primitive BCH codes over F2f , where f = 7, 8.
متن کاملThe Weight Distributions of a Class of Cyclic Codes with Three Nonzeros over F3
Cyclic codes have efficient encoding and decoding algorithms. The decoding error probability and the undetected error probability are usually bounded by or given from the weight distributions of the codes. Most researches are about the determination of the weight distributions of cyclic codes with few nonzeros, by using quadratic form and exponential sum but limited to low moments. In this pape...
متن کاملWeight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences
We study [2m−1, 2m]-binary linear codes whose weights lie between w0 and 2m−w0, where w0 takes the highest possible value. Primitive cyclic codes with two zeros whose dual satisfies this property actually correspond to almost bent power functions and to pairs of maximum-length sequences with preferred crosscorrelation. We prove that, for odd m, these codes are completely characterized by their ...
متن کاملRelative generalized Hamming weights of cyclic codes
Abstract. Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and stor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1301.4773 شماره
صفحات -
تاریخ انتشار 2013